Vector Approximation based Indexing for High-Dimensional Multimedia Databases

نویسندگان

  • Imane Daoudi
  • Saïd El Alaoui Ouatik
  • A. El Kharraz
  • Khalid Idrissi
  • Driss Aboutajdine
چکیده

the proliferation of multimedia data, there is an increasing need to support the indexing and searching of high-dimensional data. In this paper, we propose an efficient indexing method for high-dimensional multimedia databases using the filtering approach, known also as vector approximation approach which supports the nearest neighbor search efficiently. Our technique called RA +-Blocks (Region Approximation Blocks) divides a high-dimensional feature vector space into compact and disjoined regions. Each region will be approximated by two bit-strings according to the RA-Blocks technique. RA +-Blocks improves the division strategy of data space compared to the RA-Blocks. From our experiment using high-dimensional feature vectors, we show that RA +-Blocks achieves better performance on the nearest neighbor search than VA-File and RA-Blocks on both uniform and real data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ND-Tree: Multidimensional Indexing Structure

The importance of multimedia databases has been growing over the last years in the most diverse areas of application, such as: Medicine, Geography, etc. With the growth of importance and of use, including the explosive increase of multimedia data on the Internet, comes the larger dimensions of these databases. This evolution creates the need for more efficient indexing structures in a way that ...

متن کامل

High-Dimensional Indexing for Multimedia Features

Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in high-dimensional spaces, the huge number of features is a challenge to existing indexing structures. Due to increasing overlap with growing dimensionality, they eventually fail to deliver runtime improvements. In this work, we prop...

متن کامل

Fuzzy Clustering Method for Content-based Indexing

E cient and accurate information retrieval is one of the main issues in multimedia databases. In content-based multimedia retrieval databases, contents or features of the database objects are used for retrieval. To retrieve similar database objects, we often perform a nearest-neighbor search. A nearest-neighbor search is used to retrieve similar database objects with features nearest to the que...

متن کامل

High Dimensional Feature Indexing Using Hybrid Trees

Feature based similarity search is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high dimensional feature space which is indexed using a multidimensional data structure. Similarity search then corresponds to a range search over the data structure. Traditional multidimensional data structures (e.g., R-tree, KDB-tree, gr...

متن کامل

An efficient nearest neighbor search in high-dimensional data spaces

Similarity search in multimedia databases requires an efficient support of nearest neighbor search on a large set of high-dimensional points. A technique applied for similarity search in multimedia databases is to transform important properties of the multimedia objects into points of a high-dimensional feature space. The feature space is usually indexed using a multidimensional index structure...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Engineering Letters

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2008